Implementing Unitary 2-Designs Using Random Diagonal-unitary Matrices

نویسندگان

  • Yoshifumi Nakata
  • Christoph Hirche
  • Ciara Morgan
  • Andreas J. Winter
چکیده

Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diagonal-unitaries. 1998 ACM Subject Classification H.1.1 Systems and Information Theory

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oracular Approximation of Quantum Multiplexors and Diagonal Unitary Matrices

We give a new quantum circuit approximation for quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary matrices.

متن کامل

An Application of theBruhat Decomposition to the Design of Full Diversity Unitary Space-Time Codes

A full diversity constellation, that is, a set of unitary matrices whose differences have nonzero determinant, is a design criterion for codes with good performance using differential unitary space-time modulation. Recently, fixed-point free groups and the infinite group SU(2) have been used to produce full diversity unitary group constellations. In this paper, we present a new Bruhat decomposi...

متن کامل

Some Analogs of the Generalized Principal Axis Transformation

It is known that two normal matrices can be diagonalized by the same unitary transformation if and only if they commute ; this theorem is ordinarily stated for hermitian matrices. Some generalizations of this theorem are known. According to a theorem due to Eckert and Young, if A and B are two rXs matrices, there are two unitary matrices U and V such that UAV=DX and UBV=D2, D\ and D2 diagonal m...

متن کامل

On a composition of digraphs

Abstract. Many “good” topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property “being the digraph of a unitary matrix” as additional criterion for the design of new interconnection networks. We define a composition of digraphs, which we call diagonal union. Diagonal union can be used to construct dig...

متن کامل

On the mean density of complex eigenvalues for an ensemble of random matrices with prescribed singular values

Given any fixed N×N positive semi-definite diagonal matrix G ≥ 0 we derive the explicit formula for the density of complex eigenvalues for random matrices A of the form A = U √ G where the random unitary matrices U are distributed on the group U(N) according to the Haar measure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015